Generalized Digital Trees and Their Difference—Differential Equations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Digital Trees and Their Difference-Differential Equations

Consider a tree partitioning process in which n elements are split into b at the root of a tree ( b a design parameter), the rest going recursively into two subtrees with a binomial probability distribution. This extends some familiar tree data structures of computer science like the digital trie and the digital search tree. The exponential generating function for the expected size of the tree ...

متن کامل

Generalized Dyck equations and multilabel trees

New topological operations are introduced in order to recover the generalized Dyck equations presented by D. Arquès et al. in another way for the generating functions of maps and colored maps, by decomposing maps topologically and bijectively. By repeatedly applying the operations which made it possible to reveal the generalized Dyck equations for the successive transformed maps, oneto-one corr...

متن کامل

Generalized Maxwell Equations and Their Solutions

The generalized Maxwell equations are considered which include an additional gradient term. Such equations describe massless particles possessing spins one and zero. We find and investigate the matrix formulation of the first order of equations under consideration. All the linearly independent solutions of the equations for a free particle are obtained in terms of the projection matrix-dyads (d...

متن کامل

Generalized Markoff Equations, Euclid Trees, and Chebyshev Polynomials

The Markoff equation is x+y+z = 3xyz, and all of the positive integer solutions of this equation occur on one tree generated from (1, 1, 1), which is called the Markoff tree. In this paper, we consider trees of solutions to equations of the form x + y + z = xyz + A. We say a tree of solutions satisfies the unicity condition if the maximum element of an ordered triple in the tree uniquely determ...

متن کامل

Autoconvolution equations and generalized Mittag-Leffler ‎functions

This article is devoted to study of the autoconvolution equations and generalized Mittag-Leffler functions. These types of equations are given in terms of the Laplace transform convolution of a function with itself. We state new classes of the autoconvolution equations of the first kind and show that the generalized Mittag-Leffler functions are solutions of these types of equations. In view of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Random Structures and Algorithms

سال: 1992

ISSN: 1042-9832,1098-2418

DOI: 10.1002/rsa.3240030309